Bounds on Multiprocessing Timing Anomalies
نویسنده
چکیده
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
منابع مشابه
10 th International Workshop on Worst - Case Execution Time
Computing tight WCET bounds in the presence of timing anomalies – found in almost any modern hardware architecture – is a major challenge of timing analysis. In this paper, we renew the discussion about timing anomalies, demonstrating that even simple hardware architectures are prone to timing anomalies. We furthermore complete the list of timing-anomalous cache replacement policies, proving th...
متن کاملTiming Anomalies Reloaded
Computing tight WCET bounds in the presence of timing anomalies – found in almost any modern hardware architecture – is a major challenge of timing analysis. In this paper, we renew the discussion about timing anomalies, demonstrating that even simple hardware architectures are prone to timing anomalies. We furthermore complete the list of timing-anomalous cache replacement policies, proving th...
متن کاملEecient Methods for Validating Timing Constraints in Multiprocessor and Distributed Systems
This paper discusses the diiculties in validating timing constraints of dynamic multiprocessor and distributed systems. Some worst-case bounds and ee-cient algorithms now exist for the special case where jobs are independent. These results are summarized.
متن کاملApproximate Time Separation of Events in Practice
Finding bounds on the time separations between events is a fundamental problem in the analysis of concurrent systems. In [4], we proposed a polynomial-time approximate algorithm for computing bounds on the separations between all pairs of events in acyclic timing constraint graphs. This paper describes applications of our algorithm to two interesting problems: (i) a buffered producer-consumer s...
متن کاملTowards Multicore WCET Analysis
AbsInt is the leading provider of commercial tools for static code-level timing analysis. Its aiT Worst-Case Execution Time Analyzer computes tight bounds for the WCET of tasks in embedded real-time systems. However, the results only incorporate the core-local latencies, i.e. interference delays due to other cores in a multicore system are ignored. This paper presents some of the work we have d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Journal of Applied Mathematics
دوره 17 شماره
صفحات -
تاریخ انتشار 1969